Magical Stones

Memory limit: 32 MB

Famous stones Xi-- can only be found in Wonderland. Such a stone is simply a granite board with an inscription consisting only of letters X and I. Each board contains exactly letters. There are not more than positions in each board where letters X and I are next to each other.

The top and bottom sides of the stones are not fixed, so the stones can be rotated upside-down. For instance two figures below depict exactly the same stone:

Two ways of looking at the same stone. This stone is of type Xi--, but also Xi-- (and also of any type Xi-- for ).

No two magic stones in Wonderland are the same, i.e. no two stones contain the same inscription (remember that the upside-down rotation of a stone is allowed).

If it is possible to read the inscription of some stone in two different ways (using the upside-down rotation) then the canonical representation of the stone is defined as the lexicographically less of these two ways of reading the inscription. We say that inscription is lexicographically less than (assuming that lengths of and are the same) if contains letter I and contains letter X at the first position where the inscriptions differ.

If a stone's inscription is symmetrical, i.e. the upside-down rotation does not change it, then its canonical representation is defined as the unique way of reading this inscription.

Example

There are exactly 6 stones of type Xi-3-2. Their canonical representations written in lexicographical order are: III, IIX, IXI, IXX, XIX and XXX.

Alice is a well-known expert on the Xi-- stones from Wonderland. She would like to create a lexicographical index of the canonical representations of all stones of type Xi-- (for some specific values of and ). What inscription should be written at position of the index, for a given value of ?

Task

Write a programme which:

• reads numbers , and from the standard input,
• determines the -th (in the lexicographical order) canonical representation of a Xi-- stone,
• writes the result to the standard output.

Input

The first and only line of the standard input contains three integers , and (, ) separated by single spaces.

Output

The first and only line of the standard output should contain the -th (in the lexicographical order) canonical representation of a Xi-- stone.

If the number of Xi-- stones is less than then the first and only line of output should contain expression NO SUCH STONE.

Example

For the input data:

3 2 5

the correct result is:

XIX

and for the input data:

3 2 7

the correct result is:

NO SUCH STONE

Task authors: Pawel Parys, Szymon Acedanski.